Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("Asequibilidad")

Filter

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Document Type [dt]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Publication Year[py]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Discipline (document) [di]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Language

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Author Country

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Results 1 to 25 of 1439

  • Page / 58
Export

Selection :

  • and

Reachability and optimal phasing for reconfiguration in near-circular orbit formationsPALMER, Phil.Journal of guidance, control, and dynamics. 2007, Vol 30, Num 5, pp 1542-1546, issn 0731-5090, 5 p.Article

Programs with quasi-stable channels are effectively recognizableCECE, G; FINKEL, A.Lecture notes in computer science. 1997, pp 304-315, issn 0302-9743, isbn 3-540-63166-6Conference Paper

An approach to cyclic protocol validationLIU, H; MILLER, R. E.Computer communications. 1996, Vol 19, Num 14, pp 1175-1187, issn 0140-3664Article

On the intersection of controllable and reachable setsGAYEK, J. E; VINCENT, T. L.Journal of optimization theory and applications. 1986, Vol 50, Num 2, pp 267-278, issn 0022-3239Article

On pairs of vectors achieving the maximal angle of a convex coneIUSEM, Alfredo; SEEGER, Alberto.Mathematical programming. 2005, Vol 104, Num 2-3, pp 501-523, issn 0025-5610, 23 p.Article

Reachability graph for autonomous continuous Petri netsDAVID, René; ALLA, Hassane.Lecture notes in control and information sciences. 2003, pp 63-70, issn 0170-8643, isbn 3-540-40342-6, 8 p.Conference Paper

Analysis of Petri nets with a dynamic priority methodBAUSE, F.Lecture notes in computer science. 1997, pp 215-234, issn 0302-9743, isbn 3-540-63139-9Conference Paper

Reachability is decidable in the numbers gameERIKSSON, K.Theoretical computer science. 1994, Vol 131, Num 2, pp 431-439, issn 0304-3975Article

Reachability of a system described by the multidimensional Roesser modelKUREK, J. E.International Journal of Control. 1987, Vol 45, Num 5, pp 1559-1563, issn 0020-7179Article

Fate and free will in error tracesHOONSANG JIN; RAVI, Kavita; SOMENZI, Fabio et al.International journal on software tools for technology transfer (Print). 2004, Vol 6, Num 2, pp 102-116, issn 1433-2779, 15 p.Conference Paper

Practical tracking with vector settling time and vector reachability timeKOKOSY, A.IFAC international workshop on motion controlAtelier international IFAC sur motion control. 1998, pp 297-302Conference Paper

Left ideals and reachability in machinesHOFER, G.Theoretical computer science. 1989, Vol 68, Num 1, pp 49-56, issn 0304-3975Article

Universal traversal sequences of length nθ(LOGn) for cliquesKARLOFF, H. J; RAMAMOHAN PATURI; SIMON, J et al.Information processing letters. 1988, Vol 28, Num 9, pp 241-243, issn 0020-0190Article

Comments on «Some results on pole-placement and reachabilitySONTAG, E. D.Systems & control letters. 1986, Vol 8, Num 1, pp 79-83, issn 0167-6911Article

Implication theory and algorithm for reachability matrix modelOHUCHI, A; KURIHARA, M; KAJI, I et al.IEEE transactions on systems, man, and cybernetics. 1986, Vol 16, Num 4, pp 610-616, issn 0018-9472Article

SPeeDI: A verification tool for polygonal hybrid systemsASARIN, Eugene; PACE, Gordon; SCHNEIDER, Gerardo et al.Lecture notes in computer science. 2002, pp 354-358, issn 0302-9743, isbn 3-540-43997-8, 5 p.Conference Paper

prod 3.2: An advanced tool for efficient reachability analysisVARPAANIEMI, K; HELJANKO, K; LILIUS, J et al.Lecture notes in computer science. 1997, pp 472-475, issn 0302-9743, isbn 3-540-63166-6Conference Paper

Controllability in codimension oneGONCALVES, J. B.Journal of differential equations (Print). 1987, Vol 68, Num 1, pp 1-9, issn 0022-0396Article

Lyapunov-like equations and reachability/observability Gramians for descriptor systemsBENDER, D. J.IEEE transactions on automatic control. 1987, Vol 32, Num 4, pp 343-348, issn 0018-9286Article

Infinity of intermediate states is decidable for Petri netsWIMMEL, Harro.Lecture notes in computer science. 2004, pp 426-434, issn 0302-9743, isbn 3-540-22236-7, 9 p.Conference Paper

Dense counter machines and verification problemsGAOYAN XIE; ZHE DANG; IBARRA, Oscar H et al.Lecture notes in computer science. 2003, pp 93-105, issn 0302-9743, isbn 3-540-40524-0, 13 p.Conference Paper

An improved reachability analysis method for strongly linear hybrid systems (extended abstract)BOIGELOT, B; BRONNE, L; RASSART, S et al.Lecture notes in computer science. 1997, pp 167-178, issn 0302-9743, isbn 3-540-63166-6Conference Paper

Additional results on the reachability index of positive 2-D systemsBAILO, Esteban; GELONCH, Josep; ROMERO, Sergio et al.Lecture notes in control and information sciences. 2006, pp 73-80, issn 0170-8643, isbn 3-540-34771-2, 1Vol, 8 p.Conference Paper

Accurate widenings and boundedness properties of timed systemsMUKHOPADHYAY, Supratik; PODELSKI, Andreas.Lecture notes in computer science. 2001, pp 79-94, issn 0302-9743, isbn 3-540-43075-XConference Paper

The reachability and dexterity of elbow and dual-elbow robot manipulatorsEMIRIS, D. M; TOURASSIS, V. D.Journal of robotic systems. 1992, Vol 9, Num 8, pp 1021-1041, issn 0741-2223Article

  • Page / 58